/**
*      author: Y_Yao
*      created: 2024-12-13 19:07:25
**/

#include<bits/stdc++.h>

#define int LL
using namespace std;
using LL = long long;
const LL LLINF = 1e18;
const int INF = 0x3f3f3f3f;
const int N = 1e6 + 7;
int a[N];
int n;

void solve()
{
    cin >> n;
    //unordered_set<int> hash;
    int MIN = INF, MAX = 0;
    for(int i = 1;i <= n;i++)
    {
        cin >> a[i];
        MIN = min(MIN,a[i]);
        MAX = max(MAX,a[i]);
        //hash.insert(a[i]);
    }

    int gap = (MAX - MIN) / 2;
    cout << MAX - MIN << " " << MAX - gap << endl;
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    //cin >> t;
    while(t--)
    {
        solve();
    }
    return 0;
}